A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
نویسندگان
چکیده
منابع مشابه
A Reactive Local Search-Based Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
In this paper, we approximately solve the multiple-choice multi-dimensional knapsack problem. We propose an algorithm which is based upon reactive local search and where an explicit check for the repetition of configurations is added to the local search. The algorithm starts by an initial solution and improved by using a fast iterative procedure. Later, both deblocking and degrading procedures ...
متن کاملAPPROXIMATE ALGORITHM FOR THE MULTI-DIMENSIONAL KNAPSACK PROBLEM BY USING MULTIPLE CRITERIA DECISION MAKING
In this paper, an interesting and easy method to solve the multi-dimensional knapsack problem is presented. Although it belongs to the combinatorial optimization, but the proposed method belongs to the decision making field in mathematics. In order to, initially efficiency values for every item is calculated then items are ranked by using Multiple Criteria Decision Making (MCDA). Finally, ite...
متن کاملA New Hybrid Algorithm for the Multiple-Choice Multi-Dimensional Knapsack Problem
In this paper, we approximately solve the multiple-choice multi-dimensional knapsack problem. We propose a hybrid algorithm based on branch and bound method and Pareto-algebraic operations. The algorithm starts by an initial solution and then combines one-by-one groups of the problem instance to generate partial solutions in each iteration. Most of these partial solutions are discarded by Paret...
متن کاملA cooperative local search-based algorithm for the Multiple-Scenario Max-Min Knapsack Problem
The purpose of this article is to present a novel method to approximately solve the Multiple-Scenario Max-Min Knapsack Problem (MSMKP). This problem models many real world situations, e.g. when for many scenarios noted π ∈ P = {1, . . . , P}, the aim is to identify the one offering a better alternative in term of maximizing the worst possible outcome. Herein is presented a cooperative approach ...
متن کاملIterated Local Search Algorithm for the Constrained Two-Dimensional Non-Guillotine Cutting Problem
An Iterated Local Search method for the constrained two-dimensional non-guillotine cutting problem is presented. This problem consists in cutting pieces from a large stock rectangle to maximize the total value of pieces cut. In this problem, we take into account restrictions on the number of pieces of each size required to be cut. It can be classified as 2D-SLOPP (two dimensional single large o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Optimization and Applications
سال: 2005
ISSN: 0926-6003,1573-2894
DOI: 10.1007/s10589-005-3057-0